• Article  

      Meeting the deadline: On the complexity of fault-tolerant continuous gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2011)
      In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Conference Object  

      Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip 

      Georgiou, Chryssis; Gilbert, S.; Kowalski, D. R. (2010)
      In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
    • Article  

      A process calculus for dynamic networks 

      Kouzapas, D.; Philippou, Anna (2011)
      In this paper we propose a process calculus framework for dynamic networks in which the network topology may change as computation proceeds. The proposed calculus allows one to abstract away from neighborhood-discovery ...